Error analysis of some techniques for updating orthogonal decompositions
نویسندگان
چکیده
منابع مشابه
Orthogonal Rank Decompositions for Tensors
The theory of orthogonal rank decompositions for matrices is well understood, but the same is not true for tensors. For tensors, even the notions of orthogonality and rank can be interpreted several diierent ways. Tensor decompositions are useful in applications such as principal component analysis for multiway data. We present two types of orthogonal rank decompositions and describe methods to...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولOrthogonal Tensor Decompositions
We explore the orthogonal decomposition of tensors (also known as multidimensional arrays or n-way arrays) using two different definitions of orthogonality. We present numerous examples to illustrate the difficulties in understanding such decompositions. We conclude with a counterexample to a tensor extension of the Eckart-Young SVD approximation theorem by Leibovici and Sabatier [Linear Algebr...
متن کاملOrthogonal H-decompositions
An H-decomposition of a graph G is a set L of edge-disjoint Hsubgraphs of G, such that each edge of G appears in some element of L. A k-orthogonal H-decomposition of a graph G is a set of k H-decompositions of G, such that any two copies of H in any two distinct H-decompositions have at most one edge in common. We prove that for every fixed graph H and every fixed integer k ≥ 1, if n is suffici...
متن کاملOrthogonal Decompositions of Complete Digraphs
A family G of isomorphic copies of a given digraph ~ G is said to be an orthogonal decomposition of the complete digraph ~ D n by ~ G, if every arc of ~ D n belongs to exactly two members of G and the union of any two diierent elements from G contains precisely one pair of reverse arcs. Given a digraph ~ H, an ~ H-family m ~ H is the vertex-disjoint union of m copies of ~ H. In this paper, we c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1980
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1980-0559196-9